Optimizing for reduced code space using genetic algorithms
نویسندگان
چکیده
منابع مشابه
Code Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the decoding dictionary is often small in comparison to the number of all possible macros. Choosing the macros that yield the best compaction is a di cult subset selection problem because multiple, but colliding, macros may ...
متن کاملOptimizing Ontology Alignments by Using Genetic Algorithms
In this work we present GOAL (Genetics for Ontology Alignments) a new approach to compute the optimal ontology alignment function for a given ontology input set. Although this problem could be solved by an exhaustive search when the number of similarity measures is low, our method is expected to scale better for a high number of measures. Our approach is a genetic algorithm which is able to wor...
متن کاملOptimizing Question-Answering Systems Using Genetic Algorithms
In this paper, we consider the challenge of optimizing the behaviour of a question-answering system that can adapt its sequence of processing steps to meet the information needs of a user. One problem is that the sheer number of possible processing sequences the system could use makes it impossible to conduct a complete search for the optimal sequence. Instead, we have developed a genetic algor...
متن کاملOptimizing RDF Chain Queries using Genetic Algorithms
In an Electronic Commerce environment, Semantic Web technologies are promising enablers for large-scale knowledge-based systems, as they facilitate machine-interpretability of data through effective data representation. Fast query engines are required for efficient real-time querying of large amounts of data, usually represented using the Resource Description Framework (RDF). An RDF model is a ...
متن کاملOptimizing GoTools' Search Heuristics using Genetic Algorithms
GoTools is a program which solves life & death problems in the game of Go. This paper describes experiments using a Genetic Algorithm to optimize heuristic weights used by GoTools’ tree-search. The complete set of heuristic weights is composed of di erent subgroups, each of which can be optimized with a suitable tness function. As a useful side product, an MPI interface for FreePascal was imple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 1999
ISSN: 0362-1340,1558-1160
DOI: 10.1145/315253.314414